Conventions for Quantum Pseudocode

ثبت نشده
چکیده

A few conventions for thinking about and writing quantum pseu-docode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a quantum random access machine (QRAM) model for quantum computing. In principle a formal version of quantum pseudocode could be used in a future extension of a conventional language. Note: This report is preliminary. Please let me know of any suggestions , omissions or errors so that I can correct them before distributing this work more widely.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Schumacher's Quantum Data Compression as a Quantum Computation Typeset Using Revt E X 2

An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using O(n 3) two-and three-bit primitive reversible operati...

متن کامل

A novel idea of pseudo-code generator in quantum-dot cellular automata \(QCA\)

In present work, we have implemented the pseudo-code (PN-code) generator using quantum-dot cellular (QCA) technology. Simulation results are obtained from QCA designer software. The PN-code generation is of paramount importance for any secure communication system. The complex code generated is used to scramble incoming plain text. At the receiving end, the same code is generated and successfull...

متن کامل

4 A probable experiment : A Transverse Field Ising Spin ( Super ) – Hamiltonian

Some supersymmetric Markov receptive sampling denoted C(R) for k = m|n reasonably permits uniform symbols on some input space of form η , in the scope of empirical evidence pertaining to supersymmetry in the biological brain. (See pseudocode)

متن کامل

A MAPLE Symbolic-Numeric Program for Solving the 2D-Eigenvalue Problem by a Self-consistent Basis Method

The symbolic-numeric program SELFA for solving the the 2D boundary-value problem in self-consistent basis method is presented. The corresponding algorithm of this program using a conventional pseudocode is described too. As example, the energy spectrum and wave functions of E-type for generalized Henon–Heiles Hamiltonian were obtained.

متن کامل

Supplement to “ Subnetwork State Functions Define Dysregulated Subnetworks in Cancer ” ∗ Salim

In this supplementary document, we prove two theorems that support the algorithms described in [1] and we present experimental results from systematic study of the performance of Crane when the value of the tuneable parameters are varied. First, in Theorem 1, we provide bound on the score of a state function that can be obtained by extending that state function, in terms of simple statistics of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996